The Refined Calculus of Inductive Construction: Parametricity and Abstraction

We present a refinement of the Calculus of Inductive Constructions in which one can easily define a notion of relational parametricity. It provides a new way to automate proofs in an interactive theorem prover like Coq

Hereditary Substitutions for Simple Types, Formalized

International audienceWe analyze a normalization function for the simply typed lambda-calculus based on hereditary substitutions, a technique developed by Pfenning et al. The normalizer is implemented in Agda, a total language where all programs terminate. It requires no termination proof since it is structurally recursive which is recognized by Agda's termination checker. Using Agda as an interactive theorem prover we establish that our normalization function precisely identifies beta-eta-equivalent terms and hence can be used to decide beta-eta-equality. An interesting feature of this approach is that it is clear from the construction that beta-\eta-equality is primitive recursive

Parametricity in an Impredicative Sort

Reynold\u27s abstraction theorem is now a well-established result for a large class of type systems. We propose here a definition of relational parametricity and a proof of the abstraction theorem in the Calculus of Inductive Constructions (CIC), the underlying formal language of Coq, in which parametricity relations\u27 codomain is the impredicative sort of propositions. To proceed, we need to refine this calculus by splitting the sort hierarchy to separate informative terms from non-informative terms. This refinement is very close to CIC, but with the property that typing judgments can distinguish informative terms. Among many applications, this natural encoding of parametricity inside CIC serves both theoretical purposes (proving the independence of propositions with respect to the logical system) as well as practical aspirations (proving properties of finite algebraic structures). We finally discuss how we can simply build, on top of our calculus, a new reflexive Coq tactic that constructs proof terms by parametricity

Typeful Normalization by Evaluation

We present the first typeful implementation of Normalization by Evaluation for the simply typed lambda-calculus with sums and control operators: we guarantee type preservation and eta-long (modulo commuting conversions), beta-normal forms using only Generalized Algebraic Data Types in a general-purpose programming language, here OCaml; and we account for sums and control operators with Continuation-Passing Style. First, we implement the standard NbE algorithm for the implicational fragment in a typeful way that is correct by construction. We then derive its call-by-value continuation-passing counterpart, that maps a lambda-term with sums and call/cc into a CPS term in normal form, which we express in a typed dedicated syntax. Beyond showcasing the expressive power of GADTs, we emphasize that type inference gives a smooth way to re-derive the encodings of the syntax and typing of normal forms in Continuation-Passing Style

Extending SMTCoq, a Certified Checker for SMT (Extended Abstract)

This extended abstract reports on current progress of SMTCoq, a communication tool between the Coq proof assistant and external SAT and SMT solvers. Based on a checker for generic first-order certificates implemented and proved correct in Coq, SMTCoq offers facilities both to check external SAT and SMT answers and to improve Coq's automation using such solvers, in a safe way. Currently supporting the SAT solver zChaff, and the SMT solver veriT for the combination of the theories of congruence closure and linear integer arithmetic, SMTCoq is meant to be extendable with a reasonable amount of effort: we present work in progress to support the SMT solver CVC4 and the theory of bit vectors.Comment: In Proceedings HaTT 2016, arXiv:1606.0542

Which Way Was I Going? Contextual Retrieval Supports the Disambiguation of Well Learned Overlapping Navigational Routes

Groundbreaking research in animals has demonstrated that the hippocampus contains neurons that distinguish betweenoverlapping navigational trajectories. These hippocampal neurons respond selectively to the context of specific episodes despite interference from overlapping memory representations. The present study used functional magnetic resonanceimaging in humans to examine the role of the hippocampus and related structures when participants need to retrievecontextual information to navigate well learned spatial sequences that share common elements. Participants were trained outside the scanner to navigate through 12 virtual mazes from a ground-level first-person perspective. Six of the 12 mazes shared overlapping components. Overlapping mazes began and ended at distinct locations, but converged in the middle to share some hallways with another maze. Non-overlapping mazes did not share any hallways with any other maze. Successful navigation through the overlapping hallways required the retrieval of contextual information relevant to thecurrent navigational episode. Results revealed greater activation during the successful navigation of the overlapping mazes compared with the non-overlapping mazes in regions typically associated with spatial and episodic memory, including thehippocampus, parahippocampal cortex, and orbitofrontal cortex. When combined with previous research, the current findings suggest that an anatomically integrated system including the hippocampus, parahippocampal cortex, and orbitofrontal cortexis critical for the contextually dependent retrieval of well learned overlapping navigational routes

Pseudo-Weight: Making Tabletop Interaction with Virtual Objects More Tangible

International audienceIn this paper we show that virtual objects manipulated on a tabletop interaction device can be augmented to provide the illusion they have a weight. This weight offers a supplemental channel to provide information about graphical objects without cluttering the visual display. To create such a pseudo-weight illusion on a passive device, the pressure applied with the fingers during the interaction has to be captured. We show that this pressure can be estimated without hardware modification on some touch sensitive tabletop setups (e.g., MERL's DiamondTouch). Two controlled experiments show that pseudo-weight is perceived effectively. The first one demonstrates that users, without training and without previous knowledge of the system, can accurately rank virtual objects according to their pseudo-weights, provided they are sufficiently distinct. The second controlled experiment investigates more formally the relation between the pseudo-weight and the actual perception of the users

Evaluating the decisional balance construct of the Transtheoretical Model: are two dimensions of pros and cons really enough?

Objectives: The Transtheoretical Model of behavior change (TTM) postulates that behavior change is a process involving progress through five distinct stages of change (SOC). One of the key components for progress to a later stage is decisional balance (pros and cons of changing to the target behavior). The goal of the present study is to test the two dimensions of decisional balance as postulated in the TTM in the context of exercising behavior. Methods: The analyses are based on data from an online survey of 266 freshman students at the University of Zurich; participants self-reported their frequency of exercising and their weighing of the importance of 49 pros and cons of exercising. Results: The results indicate that a two-dimensional solution of decisional balance is insufficient. The analysis of pros and cons of exercising yielded a seven-factor solution with in part different progressions through the SOC. Conclusions: With the subdivision into different pros and cons, intervention programs can be developed that better match the needs of participants in terms of fostering and decreasing the most important pros and cons of exercisin

A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses

International audienceWe present a way to enjoy the power of SAT and SMT provers in Coq without compromising soundness. This requires these provers to return not only a yes/no answer, but also a proof witness that can be independently rechecked. We present such a checker, written and fully certified in Coq. It is conceived in a modular way, in order to tame the proofs' complexity and to be extendable. It can currently check witnesses from the SAT solver ZChaff and from the SMT solver veriT. Experiments highlight the efficiency of this checker. On top of it, new reflexive Coq tactics have been built that can decide a subset of Coq's logic by calling external provers and carefully checking their answers

Modular pre-processing for automated reasoning in dependent type theory

The power of modern automated theorem provers can be put at the service of interactive theorem proving. But this requires in particular bridging the expressivity gap between the logics these provers are respectively based on. This paper presents the implementation of a modular suite of pre-processing transformations, which incrementally bring certain formulas expressed in the Calculus of Inductive Constructions closer to the first-order logic of Satifiability Modulo Theory solvers. These transformations address issues related to the axiomatization of inductive types, to polymorphic definitions or to the different implementations of a same theory signature. This suite is implemented as a plugin for the Coq proof assistant, and integrated to the SMTCoq toolchain